super vertex
英 [ˈsuːpə(r) ˈvɜːteks]
美 [ˈsuːpər ˈvɜːrteks]
网络 超顶点
双语例句
- A graph G is said to have super edge-connectivity or simply G is super λ if G is max λ and every minimum edge-cut set of G isolates one vertex.
进一步，如果图G是极大边连通的，且每一个最小边割只孤立G的一个点，则称G是超边连通的（super-λ）。